AliquotG: An Improved Heuristic Algorithm for Genome Aliquoting

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AliquotG: An Improved Heuristic Algorithm for Genome Aliquoting

An extant genome can be the descendant of an ancient polyploid genome. The genome aliquoting problem is to reconstruct the latter from the former such that the rearrangement distance (i.e., the number of genome rearrangements necessary to transform the former into the latter) is minimal. Though several heuristic algorithms have been published, here, we sought improved algorithms for the problem...

متن کامل

An Improved Algorithm for Network Reliability Evaluation

Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...

متن کامل

Genome Aliquoting Revisited

We prove that the genome aliquoting problem, the problem of finding a recent polyploid ancestor of a genome, with breakpoint distance can be solved in polynomial time. We propose an aliquoting algorithm that is a 2-approximation for the genome aliquoting problem with double cut and join distance, improving upon the previous best solution to this problem, Feijão and Meidanis' 4-approximation alg...

متن کامل

An Improved Di-Directional Heuristic Search Algorithm

A m o d i f i c a t i o n o f P o h l ' s b i d i r e c t i o n a l h e u r i s t i c search a l g o r i t h m i s d e s r i b e d t o g e t h e r w i t h a s i m p l i f i e d i m p l e m e n t a t i o n . Theorems are p roved about c o n d i t i o n s y i e l d i n g s h o r t e s t p a t h s . The r e s u l t s a re g i v e n o f a wors t case a n a l y s i s o f d i f f e r e n t a l g o r ...

متن کامل

An Improved Algorithm for Genome Rearrangements

A remarkable pattern of evolutionary is that many species have closely related gene sequences but differ dramatically in gene order. It raises a new challenge in aligning two genome sequences that we have to consider changes at both the nucleotide level and the locus level such as gene rearrangements, duplication or loss. Finding the series of rearrangements at the same time with changes at nuc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PLoS ONE

سال: 2013

ISSN: 1932-6203

DOI: 10.1371/journal.pone.0064279